Permutations of finite fields with prescribed properties
نویسندگان
چکیده
For cryptographic applications, the behaviour of the difference map is of importance and since there are no perfect nonlinear (PN) permutations, almost perfect nonlinear (APN) permutations have attracted a lot of attention in the last decades. Costas permutations, which are also extreme with respect to the behaviour of their difference maps, were originally introduced in connection with applications in radar communication. The relation between APN and Costas permutations of the rings Zn has been first investigated in [2]. Enumeration results in [2] show that the sizes of the sets of permutations of Zn, for 1 ≤ n ≤ 18, which are both Costas and APN, vary depending on n without any appearent reason, hence the relation between APN and Costas permutations is described as being ”quite erratic”.
منابع مشابه
On the inverses of some classes of permutations of finite fields
We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the ...
متن کاملA note on APN permutations in even dimension
APN permutations in even dimension are vectorial Boolean functions that play a special role in the design of block ciphers. We study their properties, providing some general results and some applications to the low-dimension cases. In particular, we prove that none of their components can be quadratic. For an APN vectorial Boolean function (in even dimension) with all cubic components we prove ...
متن کاملOn the Basis Polynomials in the Theory of Permutations with Prescribed Up-down Structure
We study the polynomials which enumerate the permutations π = (π1, π2, . . . , πn) of the elements 1.2, . . . , n with the condition π1 < π2 < . . . < πn−m(or π1 > π2 > . . . > πn−m) and prescribed up-down points n−m,n−m+1, . . . , n− 1 in view of an important role of these polynomials in theory of enumeration the permutations with prescribed up-down structure similar to the role of the binomia...
متن کاملPermutations via linear translators
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with com...
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 259 شماره
صفحات -
تاریخ انتشار 2014